Linear codes from projective spaces

نویسندگان

  • Michel Lavrauw
  • Leo Storme
  • Geertrui Van de Voorde
  • GEERTRUI VAN DE VOORDE
چکیده

The linear code Cs,t(n, q) of s-spaces and t-spaces in a projective space PG(n, q), q = ph, p prime, is defined as the vector space spanned over Fp by the rows of the incidence matrix of s-spaces and t-spaces. This code generalises the code of points and lines in a projective plane, which has been intensively studied since the 1970’s. In this paper, we give an overview of what is currently known about the codes Cs,t(n, q) and their duals.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coding Theory in Projective Spaces

Given the n-dimensional space Fq , the elements of the projective spaces are all subspaces of Fq . Recently these codes have found application in error-correction of network coding. In this paper we examine a few interesting aspects of coding theory in projective spaces. We present codes and bounds in the projective spaces metric and prove that there are no perfect codes in this metric. We cons...

متن کامل

Constructions of Optical Orthogonal Codes from Finite Geometry

The link between finite geometry and various classes of error-correcting codes is well known. Arcs in projective spaces, for instance, have a close tie to linear MDS codes as well as the high-performing low-density parity-check codes. In this article, we demonstrate a connection between arcs and optical orthogonal codes (OOCs), a class of non-linear binary codes used for many modern communicati...

متن کامل

Galois geometries and coding theory

Galois geometries and coding theory are two research areas which have been interacting with each other for many decades. From the early examples linking linear MDS codes with arcs in finite projective spaces, linear codes meeting the Griesmer bound with minihypers, covering radius with saturating sets, links have evolved to functional codes, generalized projective Reed–Muller codes, and even fu...

متن کامل

Optimal Simplices and Codes in Projective Spaces

We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of several hitherto unknown families of simplices in quaternionic projective spaces and the octonionic projective plane. The most noteworthy cases are 15-point simplices in HP2 and 27-point simplices in OP2, both of which a...

متن کامل

Embedding the Linear Structure of Planar Spaces into Projective Spaces

We show that every non-degenerate planar space with v points and π planes can be embedded as a linear space into PG(3, q) for some prime power q provided that 1000(π − v) ≤ v5/6.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009